A Generalized Minimal Hitting-Set Algorithm to Handle Diagnosis With Behavioral Modes
نویسندگان
چکیده
منابع مشابه
A Generalization of the GDE Minimal Hitting-Set Algorithm to Handle Behavioral Modes
A generalization of the minimal hitting-set algorithm given by deKleer and Williams is presented. The original algorithm handles only one faulty mode per component and only positive conflicts. In contrast, the new algorithm presented here handles more than two modes per component and also non-positive conflicts. The algorithm computes a logical formula that characterizes all diagnoses. Instead ...
متن کاملA Statistics-directed Minimal Hitting Set Algorithm ⋆
Generating minimal hitting sets of a collection of sets is known to be NPhard, necessitating heuristic approaches to handle large problems. In this paper a low-cost, approximate minimal hitting set (MHS) algorithm, coined Staccato, is presented. Staccato uses a heuristic function, borrowed from a lightweight, statistics-based software fault localization approach, to guide the MHS search. Given ...
متن کاملA Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis
Generating minimal hitting sets of a collection of sets is known to be NP-hard, necessitating heuristic approaches to handle large problems. In this paper a low-cost, approximate minimal hitting set (MHS) algorithm, coined STACCATO, is presented. STACCATO uses a heuristic function, borrowed from a lightweight, statistics-based software fault localization approach, to guide the MHS search. Given...
متن کاملDiagnosis with Behavioral Modes
Diagnostic tasks involve identifying faulty components from observations of symptomatic device behavior. This paper presents a general diagnostic theory that uses the perspective of diagnosis as identifying consistent modes of behavior, correct or faulty. Our theory draws on the intuitions behind recent diagnostic theories to identify faulty components wi thout necessarily knowing how they fai ...
متن کاملComputing Minimal Hitting Sets with Genetic Algorithm
A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no element can be removed from S without violating the hitting set property, S is considered to be minimal. Several interesting problems can be partly formulated as ones that a minimal hitting set or more ones have to be found. Many of these problems are required for proper soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
سال: 2011
ISSN: 1083-4427
DOI: 10.1109/tsmca.2010.2048750